An evaluation of efficient caching models for distributed persistent stores

نویسنده

  • Bengt Johansson
چکیده

This article is an evaluation of how caching-techniques from multiprocessor computers, can be used to improve the efficiency of distributed software, such as distributed persistent stores. It also describes the practical implementation of the weak cache consistency model in a distributed persistent store and presents a practical evaluation of this model compared to the sequential consistency model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EAR LY DRA FT Efficient caching in distributed persistent stores

This article shows how techniques from hardware systems like multiprocessor computers can be used to improve the efficiency of distributed software, such as distributed persistent stores. It also describes the practical implementation of a particular caching protocol for a distributed store.

متن کامل

Persistent Store Interface: A foundation for scalable persistent system design CURRENTLY UNDER EXAMINATION

The subject of this thesis is scalability and persistence. A convergence of computing and communications technologies has lead to the ‘information explosion’. Demand for information has grown at an unprecedented pace, placing pressure on the scalability of information servers. At the same time there has been a revolution in switching technology which has seen the once exotic tightly coupled dis...

متن کامل

Persistent Store Interface: A foundation for scalable persistent system design

The subject of this thesis is scalability and persistence. A convergence of computing and communications technologies has lead to the ‘information explosion’. Demand for information has grown at an unprecedented pace, placing pressure on the scalability of information servers. At the same time there has been a revolution in switching technology which has seen the once exotic tightly coupled dis...

متن کامل

Scalability of Avoidance-Based Transactional Cache Coherency

The scalability of cache coherency schemes plays a major role in the overall performance of any scalable distributed system that utilises client data caching. In particular, transactional cache coherency algorithms must be scalable if the systems that are built around them, such as persistent object stores, are to be scalable. The avoidance-based transactional cache coherency [Hughes 1998] algo...

متن کامل

Experience Using a Globally Shared State Abstraction to Support Distributed Applications

In this paper, we evaluate the effectiveness of basing distributed systems on a persistent globally shared address space abstraction, as implemented by Khazana. Khazana provides shared state management services to distributed application developers, including consistent caching, automated replication and migration of data, location management, access control, and (limited) fault tolerance. We r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000